Minimum implicational basis for ∧-semidistributive lattices
نویسندگان
چکیده
منابع مشابه
Minimum Implicational Basis for -Semidistributive Lattices
For a ∧-semidistributive lattice L, we study some particular implicational systems and show that the cardinality of a minimum implicational basis is polynomial in the size of join-irreducible elements of the lattice L. We also provide a polynomial time algorithm to compute a minimum implicational basis for L. © 2006 Published by Elsevier B.V.
متن کاملUnbounded Semidistributive Lattices
The purpose of this note is to illustrate a construction technique which has proved useful, and apply it to solve an interesting problem. For a more complete discussion of the theory of bounded homomorphisms and lattices, see Chapter II of [3]. 1. Unbounded lattices We begin with a well known criterion for meet semidistributivity. If L is a finite lattice and a ∈ J(L), let κ(a) be the largest e...
متن کاملDerived Semidistributive Lattices
Let C(L) denote the set of covers of a poset L: γ ∈ C(L) if and only γ = (γ0, γ1) ∈ L×L and the interval {x | γ0 ≤ x ≤ γ1 } is a two elements poset. If L is a lattice then there is a natural ordering of C(L): γ ≤ δ if and only if γ0 ≤ δ0, γ1 6≤ δ0, and γ1 ≤ δ1. That is, γ ≤ δ if and only if the cover γ transposes up to δ. For α ∈ C(L) let C(L,α) denote the component of the poset C(L) connected ...
متن کاملAlgorithms for k-meet-semidistributive lattices
In this paper we consider k-meet-semidistributive lattices and we are interested in the computation of the set-colored poset associated to an implicational base. The parameter k is of interest since for any nite lattice L there exists an integer k for which L is k-meetsemidistributive. When k = 1 they are known as meet-semidistributive lattices. We rst give a polynomial time algorithm to comput...
متن کاملJoin-semidistributive Lattices of Relatively Convex Sets
We give two sufficient conditions for the lattice Co(Rn, X) of relatively convex sets of Rn to be join-semidistributive, where X is a finite union of segments. We also prove that every finite lower bounded lattice can be embedded into Co(Rn, X), for a suitable finite subset X of Rn.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2006
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2006.04.004